Isomorphism Theorems in the Primary Categories of Krasner Hypermodules
نویسندگان
چکیده
منابع مشابه
Isomorphism theorems of fuzzy hypermodules
In this paper we define and study a new class of subfuzzy hypermodules of a fuzzy hypermodule that we call normal subfuzzy hypermodules. The connection between hypermodules and fuzzy hypermodules can be used as a tool for proving results in fuzzy hypermodules. In this manner we analyse three isomorphism theorems for fuzzy hypermodules.
متن کاملOn (fuzzy) Isomorphism Theorems of Soft Γ-hypermodules
To solve complicated problems in economics, engineering, and environment, we cannot successfully use classical methods because of various uncertainties typical for those problems. There are three theories: theory of probability, theory of fuzzy sets, and the interval mathematics which we can consider as mathematical tools for dealing with uncertainties. Uncertainties cannot be handled using tra...
متن کاملOn Isomorphism Theorems of Fn -Polygroups
In this paper, the notion of fuzzy n-polygroups (Fn -polygroups) is introduced and some related properties are investigated. In this regards, the concepts of normal F-subpolygroups and homomorphisms of Fn-polygroups are adopted. Also, the quotient of Fn-polygroups by defining regular relations are studied. Finally, the classical isomorphism theorems of groups are generalized to Fn-polygroups p...
متن کاملon isomorphism theorems of fn -polygroups
in this paper, the notion of fuzzy n-polygroups (fn -polygroups) is introduced and some related properties are investigated. in this regards, the concepts of normal f-subpolygroups and homomorphisms of fn-polygroups are adopted. also, the quotient of fn-polygroups by defining regular relations are studied. finally, the classical isomorphism theorems of groups are generalized to fn-polygroups p...
متن کاملThe Graph Isomorphism Problem and approximate categories
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many pairs of graphs, but the pairs of non-isomorphic graphs constructed by Cai, Fürer and Immerman it cannot distinguish. If d is fixed, then the WL-algorithm run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2019
ISSN: 2073-8994
DOI: 10.3390/sym11050687